home *** CD-ROM | disk | FTP | other *** search
/ Resource Library: Multimedia / Resource Library: Multimedia.iso / space / educatio / mac / hyprspcm.hqx / Hyper-Space Mathematics / BMAP_43359.png < prev    next >
Portable Network Graphic  |  1993-02-04  |  3KB  |  512x342  |  1-bit (2 colors)
Labels: text | screenshot | font | document
OCR: Suppose we have a "message" in the form of a four-bit binary string: that is, the message is in the form abcd where each of a, b, c, d is 0 or 1. The Hamming matrix for a message of this type is the 4 x 8 matrix H: 00001111 H = 00110011 01010101 11111111 The structure of the matrix is as follows: For a message containing 4 bits, we need 23= 8 columns and 4 rows. The binary numerals for 0 through 7, ( written in 3-digit form as 000, 001, 010, .. . ) are used, in order, as the first three entries in each column; the bottom entry is always 1. A Hamming matrix for a 5-bit message would need 24 = 16 columns and 5 rows in order to represent the binary numerals for O through 15 (0000,0001, ...., 1111) followed by 1 in the columns. (Continued on next card.)